Survey on Convex Drawing of Planar Graph
نویسنده
چکیده
This paper presented study on convex drawing of planar graph. In graph theory, a planar graph is a graph that can be embedded in the plane. A planar graph is one that can be drawn on a plane in such a way that there are no “edge crossings,” i.e. edges intersect only at their common vertices. Convex polygon has all interior angles less than or equal to 180°. A graph is called a convex drawing if every facial cycle (face) is drawn as a convex polygon. In a convex drawing of a planar graph, all edges are drawn by straight line segments in such a way that every face boundary in a convex polygon. This paper describes some of the recent works on convex drawing on planar graph.
منابع مشابه
Realizing Planar Graphs as Convex Polytopes
This is a survey on methods to construct a three-dimensional convex polytope with a given combinatorial structure, that is, with the edges forming a given 3-connected planar graph, focusing on efforts to achieve small integer coordinates.
متن کاملAlgorithms for Drawing Plane Graphs
Graph drawing addresses the problem of constructing geometric representation of information and finds applications in almost every branch of science and technology. Efficient algorithms are essential for automatic drawings of graphs, and hence a lot of research has been carried out in the last decade by many researchers over the world to develop efficient algorithms for drawing graphs. In this ...
متن کاملConvex drawings of hierarchical planar graphs and clustered planar graphs
Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, software visualisation and visualisation of social networks and biological networks. Straight-line drawing algorithms for hierarchical graphs and clustered graphs have been presented in [P. Eades, Q. Feng, X. Lin and H. Nag...
متن کاملNon-convex Representations of Graphs
We show that every plane graph admits a planar straight-line drawing in which all faces with more than three vertices are non-convex polygons.
متن کاملOn Drawing a Graph Convexly in the Plane
Let G be a planar graph and H be a subgraph of G. Given any convex drawing of H, we investigate the problem of how to extend the drawing of H to a convex drawing of G. We obtain a necessary and suucient condition for the existence and a linear algorithm for the construction of such an extension. Our results and their corollaries generalize previous theoretical and algorithmic
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013